Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7988035
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 4, 20262026-06-04T12:19:11+00:00 2026-06-04T12:19:11+00:00

class Node { int x,y; Node *left, *right; Node(int x, int y); Node(); };

  • 0
class Node
{
    int x,y;
    Node *left, *right;
    Node(int x, int y);
    Node();
};

How do I make a deque using this?

deque<Node> balBinaryTree;

gives me errors

syntax error : missing ';' before '<'
error C4430: missing type specifier - int assumed. Note: C++ does not support default-int
error C2238: unexpected token(s) preceding ';'

—edit—

—edit—
also should I do

  deque<Node> balBinaryTree;

or

  deque<Node*> balBinaryTree;
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-04T12:19:13+00:00Added an answer on June 4, 2026 at 12:19 pm
    #include <deque>
    std::deque<Node> balBinaryTree;
    

    also should I do

    deque<Node> balBinaryTree; or

    deque<Node*> balBinaryTree;

    You should decide it yourself.
    deque<Node> leads to unnecessary copying.
    deque<Node*> leads to possible memory management problems.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a Node class with the members int weight; Node *left; Node *right;
class Node { public int data; public Node left, right; public Node(int data) {
public class Node { private Node nextNode; @Override public int hashCode() { //How to
I have this code for BinaryTree creation and traversal class Node { Integer data;
I have this class: public class Source extends Node { protected DistributionSampler delay ;
I have this very simple C++ class: class Tree { public: Node *head; };
public class Node : IComparable { public object element; public Node left; public Node
I have this code fragment class bst { public node root=null; bst() { root=null;
I have a function that calculates the left and right node values for some
class Node(object): def __init__(self, data): self.data = data if __name__ == __main__: a =

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.