{"id":"b3585e9c-2880-4c49-ad3a-e6ea98311415","name":"Add Node To Bst","description":"1. You are given a partially written BST class.\r\n2. You are required to complete the body of add function. \"add\" function is expected to add a new node with given data to the tree and return the new root.\r\n3. Input and Output is managed for you.","inputFormat":"Input is managed for you","outputFormat":"Output is managed for you","constraints":"None","sampleCode":{"cpp":{"code":"#include<bits/stdc++.h>\nusing namespace std;\n\nstruct Node {\n int data;\n Node* left;\n Node* right;\n Node(int val) {\n data = val;\n left = nullptr;\n right = nullptr;\n }\n};\n\n\nNode* construct(vector<int> & arr) {\n Node* root = new Node(arr[0]);\n pair<Node*, int> p = {root, 1};\n\n stack<pair<Node*, int>> st;\n st.push(p);\n\n int idx = 1;\n while (!st.empty()) {\n if (st.top().second == 1) {\n st.top().second++;\n if (arr[idx] != -1) {\n st.top().first->left = new Node(arr[idx]);\n pair<Node*, int> lp = {st.top().first->left, 1};\n st.push(lp);\n }\n else {\n st.top().first->left = nullptr;\n }\n idx++;\n }\n else if (st.top().second == 2) {\n st.top().second++;\n if (arr[idx] != -1) {\n st.top().first->right = new Node(arr[idx]);\n pair<Node*, int> rp = {st.top().first->right, 1};\n st.push(rp);\n } else {\n st.top().first->right = nullptr;\n }\n idx++;\n }\n else {\n st.pop();\n }\n\n }\n return root;\n}\nvoid display(Node* node) {\n if (node == nullptr) {\n return;\n }\n\n string str = \" <- \" + to_string(node->data) + \" -> \";\n\n string left = (node->left == nullptr) ? \".\" : \"\" + to_string(node->left->data);\n string right = (node->right == nullptr) ? \".\" : \"\" + to_string(node->right->data);\n\n str = left + str + right;\n cout << str << endl;\n\n display(node->left);\n display(node->right);\n}\n\n\n\n\nNode* add(Node * node, int val){\n \n// Write your code here\n}\n\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n,0);\n for (int i = 0; i < n; i++) {\n string x;\n cin >> x;\n if (x == \"n\") {\n a[i] = -1;\n\n }\n else {\n a[i] = stoi(x);\n }\n }\n int data;\n cin >> data;\n Node* root = construct(a);\n root = add(root, data);\n\n display(root);\n}"},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n public static class Node {\r\n int data;\r\n Node left;\r\n Node right;\r\n\r\n Node(int data, Node left, Node right) {\r\n this.data = data;\r\n this.left = left;\r\n this.right = right;\r\n }\r\n }\r\n\r\n public static class Pair {\r\n Node node;\r\n int state;\r\n\r\n Pair(Node node, int state) {\r\n this.node = node;\r\n this.state = state;\r\n }\r\n }\r\n\r\n public static Node construct(Integer[] arr) {\r\n Node root = new Node(arr[0], null, null);\r\n Pair rtp = new Pair(root, 1);\r\n\r\n Stack<Pair> st = new Stack<>();\r\n st.push(rtp);\r\n\r\n int idx = 0;\r\n while (st.size() > 0) {\r\n Pair top = st.peek();\r\n if (top.state == 1) {\r\n idx++;\r\n if (arr[idx] != null) {\r\n top.node.left = new Node(arr[idx], null, null);\r\n Pair lp = new Pair(top.node.left, 1);\r\n st.push(lp);\r\n } else {\r\n top.node.left = null;\r\n }\r\n\r\n top.state++;\r\n } else if (top.state == 2) {\r\n idx++;\r\n if (arr[idx] != null) {\r\n top.node.right = new Node(arr[idx], null, null);\r\n Pair rp = new Pair(top.node.right, 1);\r\n st.push(rp);\r\n } else {\r\n top.node.right = null;\r\n }\r\n\r\n top.state++;\r\n } else {\r\n st.pop();\r\n }\r\n }\r\n\r\n return root;\r\n }\r\n\r\n public static void display(Node node) {\r\n if (node == null) {\r\n return;\r\n }\r\n\r\n String str = \"\";\r\n str += node.left == null ? \".\" : node.left.data + \"\";\r\n str += \" <- \" + node.data + \" -> \";\r\n str += node.right == null ? \".\" : node.right.data + \"\";\r\n System.out.println(str);\r\n\r\n display(node.left);\r\n display(node.right);\r\n }\r\n\r\n public static Node add(Node node, int data) {\r\n // write your code here\r\n }\r\n\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int n = Integer.parseInt(br.readLine());\r\n Integer[] arr = new Integer[n];\r\n String[] values = br.readLine().split(\" \");\r\n for (int i = 0; i < n; i++) {\r\n if (values[i].equals(\"n\") == false) {\r\n arr[i] = Integer.parseInt(values[i]);\r\n } else {\r\n arr[i] = null;\r\n }\r\n }\r\n\r\n int data = Integer.parseInt(br.readLine());\r\n\r\n Node root = construct(arr);\r\n root = add(root, data);\r\n\r\n display(root);\r\n }\r\n\r\n}"},"python":{"code":"import sys\nimport math\n\nclass Node:\n def __init__(self, key,left,right):\n self.left = left\n self.right = right\n self.val = key\n \nclass Pair:\n def __init__(self,node,state):\n self.node = node\n self.state = state\n\ndef construct(arr):\n root=Node(arr[0],None,None)\n rtp=Pair(root,1);\n \n st=[]\n st.append(rtp);\n \n idx=0;\n while(len(st)>0):\n top=st[-1];\n if top.state==1:\n idx+=1\n if(arr[idx]!=None):\n top.node.left = Node(arr[idx], None, None);\n lp = Pair(top.node.left, 1);\n st.append(lp);\n else:\n top.node.left=None;\n top.state+=1\n elif top.state==2:\n idx+=1\n if(arr[idx]!=None):\n top.node.right = Node(arr[idx], None, None);\n rp = Pair(top.node.right, 1);\n st.append(rp);\n else:\n top.node.right=None;\n top.state+=1\n else:\n st.pop();\n return root; \n \n\ndef display(node) :\n if (node == None):\n return;\n \n s = \" <- \" + str(node.val) + \" -> \";\n left = \".\" if node.left is None else \"\"+str(node.left.val);\n right = \".\" if node.right is None else \"\" + str(node.right.val);\n \n s=left + s + right;\n print(s);\n \n display(node.left);\n display(node.right);\n \ndef add(root, data):\n# Write your code here\n \nn=int(input())\nvalues = list(map(str, input().split()))\narr=[0]*n\nfor i in range(0,n):\n if values[i]!=\"n\":\n arr[i]=int(values[i])\n else:\n arr[i]=None\nval=int(input())\n\nroot=construct(arr)\n\nroot = add(root, val)\n\ndisplay(root)"}},"points":10,"difficulty":"easy","sampleInput":"23\r\n50 25 12 n n 37 30 n n 40 n n 75 62 60 n n 70 n n 87 n n\r\n61","sampleOutput":"25 <- 50 -> 75\r\n12 <- 25 -> 37\r\n. <- 12 -> .\r\n30 <- 37 -> 40\r\n. <- 30 -> .\r\n. <- 40 -> .\r\n62 <- 75 -> 87\r\n60 <- 62 -> 70\r\n. <- 60 -> 61\r\n. <- 61 -> .\r\n. <- 70 -> .\r\n. <- 87 -> .","questionVideo":"https://www.youtube.com/embed/ptT_aX-Id6w","hints":[],"associated":[{"id":"1790af8f-51b8-4e9c-9cf3-3c7ebe35c14b","name":"Is BST property helpful in reducing the complexity of the problem?","slug":"is-bst-property-helpful-in-reducing-the-complexity-of-the-problem","type":4},{"id":"2b709842-b405-48a4-9152-d60f78d64d26","name":"In which order are we working in Add Node to BST?","slug":"in-which-order-are-we-working-in-add-node-to-bst","type":4},{"id":"5bea6f32-ecf7-4b25-8bce-1b5c6d32fd15","name":"In which line is the error in this piece of code?","slug":"in-which-line-is-the-error-in-this-piece-of-code","type":4},{"id":"9ff87ee2-8f3b-4af4-a0dc-a0d35066ab2d","name":"What is the space complexity of Add Node to BST?","slug":"what-is-the-space-complexity-of-add-node-to-bst","type":4}],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"af4e5bec-9225-4f5f-a99b-97b23e8cf431","name":"Binary Search Tree For Beginners","slug":"binary-search-tree-for-beginners","type":0},{"id":"9ac92740-afe7-4067-b8f3-047c92d2626d","name":"Add Node To Bst","slug":"add-node-to-bst","type":1}],"next":{"id":"e80522bf-dde1-4379-bcb2-ed182f33bb4c","name":"Add Node to BST","type":3,"slug":"add-node-to-bst"},"prev":{"id":"4ce011bd-d66f-43eb-b377-3c8168e9d39c","name":"Size, Sum, Max, Min & Find in BST","type":3,"slug":"size-sum-max-min-find-in-bst"}}}1. You are given a partially written BST class. 2. You are required to complete the body of add function. "add" function is expected to add a new node with given data to the tree and return the new root. 3. Input and Output is managed for you.
{"id":"b3585e9c-2880-4c49-ad3a-e6ea98311415","name":"Add Node To Bst","description":"1. You are given a partially written BST class.\r\n2. You are required to complete the body of add function. \"add\" function is expected to add a new node with given data to the tree and return the new root.\r\n3. Input and Output is managed for you.","inputFormat":"Input is managed for you","outputFormat":"Output is managed for you","constraints":"None","sampleCode":{"cpp":{"code":"#include<bits/stdc++.h>\nusing namespace std;\n\nstruct Node {\n int data;\n Node* left;\n Node* right;\n Node(int val) {\n data = val;\n left = nullptr;\n right = nullptr;\n }\n};\n\n\nNode* construct(vector<int> & arr) {\n Node* root = new Node(arr[0]);\n pair<Node*, int> p = {root, 1};\n\n stack<pair<Node*, int>> st;\n st.push(p);\n\n int idx = 1;\n while (!st.empty()) {\n if (st.top().second == 1) {\n st.top().second++;\n if (arr[idx] != -1) {\n st.top().first->left = new Node(arr[idx]);\n pair<Node*, int> lp = {st.top().first->left, 1};\n st.push(lp);\n }\n else {\n st.top().first->left = nullptr;\n }\n idx++;\n }\n else if (st.top().second == 2) {\n st.top().second++;\n if (arr[idx] != -1) {\n st.top().first->right = new Node(arr[idx]);\n pair<Node*, int> rp = {st.top().first->right, 1};\n st.push(rp);\n } else {\n st.top().first->right = nullptr;\n }\n idx++;\n }\n else {\n st.pop();\n }\n\n }\n return root;\n}\nvoid display(Node* node) {\n if (node == nullptr) {\n return;\n }\n\n string str = \" <- \" + to_string(node->data) + \" -> \";\n\n string left = (node->left == nullptr) ? \".\" : \"\" + to_string(node->left->data);\n string right = (node->right == nullptr) ? \".\" : \"\" + to_string(node->right->data);\n\n str = left + str + right;\n cout << str << endl;\n\n display(node->left);\n display(node->right);\n}\n\n\n\n\nNode* add(Node * node, int val){\n \n// Write your code here\n}\n\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n,0);\n for (int i = 0; i < n; i++) {\n string x;\n cin >> x;\n if (x == \"n\") {\n a[i] = -1;\n\n }\n else {\n a[i] = stoi(x);\n }\n }\n int data;\n cin >> data;\n Node* root = construct(a);\n root = add(root, data);\n\n display(root);\n}"},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n public static class Node {\r\n int data;\r\n Node left;\r\n Node right;\r\n\r\n Node(int data, Node left, Node right) {\r\n this.data = data;\r\n this.left = left;\r\n this.right = right;\r\n }\r\n }\r\n\r\n public static class Pair {\r\n Node node;\r\n int state;\r\n\r\n Pair(Node node, int state) {\r\n this.node = node;\r\n this.state = state;\r\n }\r\n }\r\n\r\n public static Node construct(Integer[] arr) {\r\n Node root = new Node(arr[0], null, null);\r\n Pair rtp = new Pair(root, 1);\r\n\r\n Stack<Pair> st = new Stack<>();\r\n st.push(rtp);\r\n\r\n int idx = 0;\r\n while (st.size() > 0) {\r\n Pair top = st.peek();\r\n if (top.state == 1) {\r\n idx++;\r\n if (arr[idx] != null) {\r\n top.node.left = new Node(arr[idx], null, null);\r\n Pair lp = new Pair(top.node.left, 1);\r\n st.push(lp);\r\n } else {\r\n top.node.left = null;\r\n }\r\n\r\n top.state++;\r\n } else if (top.state == 2) {\r\n idx++;\r\n if (arr[idx] != null) {\r\n top.node.right = new Node(arr[idx], null, null);\r\n Pair rp = new Pair(top.node.right, 1);\r\n st.push(rp);\r\n } else {\r\n top.node.right = null;\r\n }\r\n\r\n top.state++;\r\n } else {\r\n st.pop();\r\n }\r\n }\r\n\r\n return root;\r\n }\r\n\r\n public static void display(Node node) {\r\n if (node == null) {\r\n return;\r\n }\r\n\r\n String str = \"\";\r\n str += node.left == null ? \".\" : node.left.data + \"\";\r\n str += \" <- \" + node.data + \" -> \";\r\n str += node.right == null ? \".\" : node.right.data + \"\";\r\n System.out.println(str);\r\n\r\n display(node.left);\r\n display(node.right);\r\n }\r\n\r\n public static Node add(Node node, int data) {\r\n // write your code here\r\n }\r\n\r\n public static void main(String[] args) throws Exception {\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int n = Integer.parseInt(br.readLine());\r\n Integer[] arr = new Integer[n];\r\n String[] values = br.readLine().split(\" \");\r\n for (int i = 0; i < n; i++) {\r\n if (values[i].equals(\"n\") == false) {\r\n arr[i] = Integer.parseInt(values[i]);\r\n } else {\r\n arr[i] = null;\r\n }\r\n }\r\n\r\n int data = Integer.parseInt(br.readLine());\r\n\r\n Node root = construct(arr);\r\n root = add(root, data);\r\n\r\n display(root);\r\n }\r\n\r\n}"},"python":{"code":"import sys\nimport math\n\nclass Node:\n def __init__(self, key,left,right):\n self.left = left\n self.right = right\n self.val = key\n \nclass Pair:\n def __init__(self,node,state):\n self.node = node\n self.state = state\n\ndef construct(arr):\n root=Node(arr[0],None,None)\n rtp=Pair(root,1);\n \n st=[]\n st.append(rtp);\n \n idx=0;\n while(len(st)>0):\n top=st[-1];\n if top.state==1:\n idx+=1\n if(arr[idx]!=None):\n top.node.left = Node(arr[idx], None, None);\n lp = Pair(top.node.left, 1);\n st.append(lp);\n else:\n top.node.left=None;\n top.state+=1\n elif top.state==2:\n idx+=1\n if(arr[idx]!=None):\n top.node.right = Node(arr[idx], None, None);\n rp = Pair(top.node.right, 1);\n st.append(rp);\n else:\n top.node.right=None;\n top.state+=1\n else:\n st.pop();\n return root; \n \n\ndef display(node) :\n if (node == None):\n return;\n \n s = \" <- \" + str(node.val) + \" -> \";\n left = \".\" if node.left is None else \"\"+str(node.left.val);\n right = \".\" if node.right is None else \"\" + str(node.right.val);\n \n s=left + s + right;\n print(s);\n \n display(node.left);\n display(node.right);\n \ndef add(root, data):\n# Write your code here\n \nn=int(input())\nvalues = list(map(str, input().split()))\narr=[0]*n\nfor i in range(0,n):\n if values[i]!=\"n\":\n arr[i]=int(values[i])\n else:\n arr[i]=None\nval=int(input())\n\nroot=construct(arr)\n\nroot = add(root, val)\n\ndisplay(root)"}},"points":10,"difficulty":"easy","sampleInput":"23\r\n50 25 12 n n 37 30 n n 40 n n 75 62 60 n n 70 n n 87 n n\r\n61","sampleOutput":"25 <- 50 -> 75\r\n12 <- 25 -> 37\r\n. <- 12 -> .\r\n30 <- 37 -> 40\r\n. <- 30 -> .\r\n. <- 40 -> .\r\n62 <- 75 -> 87\r\n60 <- 62 -> 70\r\n. <- 60 -> 61\r\n. <- 61 -> .\r\n. <- 70 -> .\r\n. <- 87 -> .","questionVideo":"https://www.youtube.com/embed/ptT_aX-Id6w","hints":[],"associated":[{"id":"1790af8f-51b8-4e9c-9cf3-3c7ebe35c14b","name":"Is BST property helpful in reducing the complexity of the problem?","slug":"is-bst-property-helpful-in-reducing-the-complexity-of-the-problem","type":4},{"id":"2b709842-b405-48a4-9152-d60f78d64d26","name":"In which order are we working in Add Node to BST?","slug":"in-which-order-are-we-working-in-add-node-to-bst","type":4},{"id":"5bea6f32-ecf7-4b25-8bce-1b5c6d32fd15","name":"In which line is the error in this piece of code?","slug":"in-which-line-is-the-error-in-this-piece-of-code","type":4},{"id":"9ff87ee2-8f3b-4af4-a0dc-a0d35066ab2d","name":"What is the space complexity of Add Node to BST?","slug":"what-is-the-space-complexity-of-add-node-to-bst","type":4}],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"af4e5bec-9225-4f5f-a99b-97b23e8cf431","name":"Binary Search Tree For Beginners","slug":"binary-search-tree-for-beginners","type":0},{"id":"9ac92740-afe7-4067-b8f3-047c92d2626d","name":"Add Node To Bst","slug":"add-node-to-bst","type":1}],"next":{"id":"e80522bf-dde1-4379-bcb2-ed182f33bb4c","name":"Add Node to BST","type":3,"slug":"add-node-to-bst"},"prev":{"id":"4ce011bd-d66f-43eb-b377-3c8168e9d39c","name":"Size, Sum, Max, Min & Find in BST","type":3,"slug":"size-sum-max-min-find-in-bst"}}}
Editor
Discussions
Show Discussion
Related Resources
