Check sum of Covered and Uncovered nodes of Binary Tree | GeeksforGeeks

2,514 views · Published 6 October 2017 · 4:00 · Indexed 22 September 2026

Channel: GeeksforGeeks · 2017 · Education

Watch on YouTube

In a binary tree, a node is called Uncovered if it appears either on left boundary or right boundary. Rest of the nodes are called covered.

Find Complete Code at GeeksforGeeks Article: http://www.geeksforgeeks.org/check-sum-covered-uncovered-nodes-binary-tree/

This video is contributed by Anant Patni

Please Like, Comment and Share the Video among your friends.

Follow us on Facebook:
https://www.facebook.com/GfGVideos/

And Twitter:
https://twitter.com/gfgvideos

Also, Subscribe if you haven't already! :)

More from this channel

• 2:03 Lexicographical concatenation of all substrings of a string | GeeksforGeeks

  GeeksforGeeks

  4,129 views · 26 February 2018

• 4:42 Count number of nodes having more number of children than parents in n-ary tree | GeeksforGeeks

  GeeksforGeeks

  1,877 views · 30 March 2018

• 3:29 Place N^2 numbers in matrix such that every row has an equal sum | GeeksforGeeks

  GeeksforGeeks

  1,155 views · 4 October 2018