Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Complete Binary Tree Inserter
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this question we print numbers in Increasing Order and Decreasing Order.
Question Name:
Complete Binary Tree Inserter
Question Link:
https://nados.io/question/complete-binary-tree-inserter
Question Statement:
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
Design an algorithm to insert a new node to a complete binary tree keeping it complete after the insertion.
Implement the CBTInserter class:
CBTInserter(TreeNode root) Initializes the data structure with the root of the complete binary tree.
int insert(int v) Inserts a TreeNode into the tree with value Node.val == val so that the tree remains complete, and returns the value of the parent of the inserted TreeNode.
TreeNode get_root() Returns the root node of the tree.
Topic: #Complete Binary Tree Inserter #trees #binary Tree
#TimeComplexity: O(N)
#SpaceComplexity: O(n) queue space
--------------------------------------------------------------
More Youtube PlayList:
Level 1 In Java English : https://www.youtube.com/playlist?list...
Level 1 In Java Hindi : https://www.youtube.com/playlist?list...
Level 2 In Java Hindi : https://www.youtube.com/playlist?list...
Constructive Algorithm - Level 3 : https://www.youtube.com/playlist?list...
Geometry - Level 3 : https://www.youtube.com/playlist?list...
Maths for CP - Level 3 : https://www.youtube.com/playlist?list...
DP - Level 3 : https://www.youtube.com/playlist?list...
Euler Tour - Level 3 : https://www.youtube.com/playlist?list...
Ternary Search : https://www.youtube.com/playlist?list...
Recursion & Backtracking - Level 1 : https://www.youtube.com/playlist?list...
Recursion & Backtracking - Level 2 : https://www.youtube.com/playlist?list...
Graphs - Level 1 : https://www.youtube.com/playlist?list...
Dyanmic Programming - Level 1 : https://www.youtube.com/playlist?list...
Generic Trees - Level 1 : https://www.youtube.com/playlist?list...
Time and Space - Level 1 : https://www.youtube.com/playlist?list...
---------------------------------------------------------------
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
We also provide professional courses with live classes and placement opportunities.
For more free study resources and information about the courses, visit: https://www.pepcoding.com/resources/
Have a look at our result: https://www.pepcoding.com/placements
Follow us on our Youtube page: https://www.youtube.com/c/Pepcoding/f...
Follow us on our FB page: https://www.facebook.com/pepcoding
Follow us on Instagram: https://www.instagram.com/pepcoding
Follow us on LinkedIn: https://www.linkedin.com/company/pepc...
Follow us on Pinterest: https://in.pinterest.com/Pepcoding/_c...
Follow us on Twitter: https://twitter.com/home
.
.
.
Happy Programming !!! Pep it up
----------------------------------------------------------------
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment