Binary Tree - 57: Remove nodes which don’t lie in any path from root to leaf with sum greater than k

preview_player
Показать описание

Solution:
- We'll traverse Binary Tree in Post Order manner starting with s = 0 & we'll add current node value when we're traversing any node
- Whenever we find Leaf node, we'll check if total added value is less than given sum. If it's less, we'll return null

- Time Complexity: O(n)
- Space Complexity: O(1)

Do Watch video for more info

This Problem is synonym of following problems:
binary tree Remove all nodes which don’t lie in any path from root to leaf with sum greater than k,
coding simplified,

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 200+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★
  1. Coding Simplified
  2. Tutorial
  3. coding simplified
  4. binary tree Remove all nodes which don’t lie in any path from root to leaf with sum greater than k
  5. binary tree
  6. binary
Рекомендации по теме
Binary Tree - 0:11:51

Binary Tree - 57: Remove nodes which don’t lie in any path from root to leaf with sum greater than k...

Binary Tree - 0:13:17

Binary Tree - 56: Remove all Nodes which lies on path with less than K length from Root to Leaf

Find Leaves of 0:09:43

Find Leaves of Binary Tree | Top Google Coding Interview Question

Binary Search Tree 0:35:24

Binary Search Tree Deletion

Lec-54: Deletion from 0:08:36

Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure

Binary Search Trees 0:11:57

Binary Search Trees - Remove Root Match Function - C++ - Part 11

Binary Tree operations 0:10:07

Binary Tree operations

How to delete 0:08:37

How to delete a node from Binary Search Tree

Ways to delete 0:02:36

Ways to delete a node in a binary tree (2 Solutions!!)

BinarySearchTreesRemove 0:13:57

BinarySearchTreesRemove

C Programming, Lecture 0:09:32

C Programming, Lecture 57, Binary Tree 03

CS2700 Programming and 0:32:59

CS2700 Programming and Data Structures | Lec 57 | AVL tree: Deletion

COMP 2503 - 0:44:58

COMP 2503 - 7.2 - Trees 2 - Binary Search Trees - BST

31251 Lecture 8.2: 0:29:03

31251 Lecture 8.2: Binary Search Trees

Day 57 - 0:19:57

Day 57 - Binary Tree to DLL || Binary Tree || GFG POTD 28 August

2 - Binary 0:13:55

2 - Binary Search Trees (BST) Deletion

Binary Search Tree 0:13:34

Binary Search Tree - Beau teaches JavaScript

BST - 25: 0:14:11

BST - 25: Remove BST Nodes outside the given range

Binary Search Tree. 0:44:52

Binary Search Tree. Deletion, Insertion, Search and Traverse operations of Binary Search Tree

13.5 REMOVE HALF 0:09:53

13.5 REMOVE HALF NODES (Tree)-Interviewbit #tree#interview#bst

Amazon /ShareChat Interview 0:05:48

Amazon /ShareChat Interview Experiance- Remove half nodes (nodes with only one child) in a tree.

Remove Leaves in 0:09:50

Remove Leaves in Generic tree | Generic Tree | In English | Java | Video_13

Data Structures - 0:03:38

Data Structures - What is a Binary Tree

Binary Tree Questions 5:01:51

Binary Tree Questions for Technical Interviews - Google, Facebook, Amazon, Microsoft

Комментарии
Автор

take the tree [1, 2, -3, -5, null, 4, null] and key=-1 for example . according to this code the answer is [1, 2, -3, null, null, 4, null] but it should be [1, null, -3, null, null, 4, null] as 2, -5 doesn't exist in any path greater than -1 .

ashgoku