HTML DOM TreeWalker nextSibling() method

The TreeWalker nextSibling() method moves the current Node to its next sibling, if any, and returns the found sibling. If no such child exists in the document, this method returns null.

Syntax:

node = treeWalker.nextSibling();

Parameters: This method takes no parameters.

Return Value:

  • Returns next visible sibling of current node if exists.
  • Returns null if no such child exists.

Example: In this example, I have created a TreeWalker with body node and hence showed the next visible sibling of that TreeWalker’s first node.



filter_none

edit
close

play_arrow

link
brightness_4
code

<!doctype html>
<html>
<head>
    <meta charset="utf-8">
<title>HTML DOM TreeWalker nextSibling() method</title>    
</head>
<body>
    <h1>GeeksforGeeks</h1>
    <p>Click Below</p>
    <button onclick="get()">Click</button>
</body>
<script>
        var treeWalker = document.createTreeWalker(
        document.body,
        NodeFilter.SHOW_ELEMENT,
        { acceptNode: function(node) { 
return NodeFilter.FILTER_ACCEPT; } },
        false
);
        function get(){
            treeWalker.firstChild();
            var node = treeWalker.nextSibling();
            console.log(node) 
        }
</script>
</html>

chevron_right


Output:

Before Button Click:

After Button Click: In console, the next visible sibling of  body’s first element of the TreeWalker node that is <p> tag can be seen.

Supported Browsers:

  • Google Chrome
  • Edge
  • Firefox
  • Safari
  • Opera
  • Internet Explorer

full-stack-img

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.